منابع مشابه
Variate Generation in One Line of Code
Alternatively, A random variate with a given non-uniform distribution can often by generated in one assignment statement if a uniform source and some simple functions are available. We review such one-line methods for most of the key distributions. 1 A MODEL OF COMPUTATION Random variate generators that are conceptually simple and quick to program become invariably popular, even if they are not...
متن کاملLearning to Schedule Straight-Line Code
Execution speed of programs on modern computer architectures is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execution efficiency, it is now customary for an optimizing compiler to employ a heuristic algorithm for instruction scheduling. These algorithms are painstakingly hand-crafted, which is expenseive and time...
متن کاملCode Sample: Object-Space Contour Line Drawing
In this code sample I will demonstrate my implementation of Object Space algorithms for drawing contour lines and suggestive contour lines on existing 3d meshes, developed for my Master’s thesis in the Graphics group at the Department of Computer Science of the Catholic University of Leuven, Belgium. The Object Space algorithms implemented here are not the most ‘interesting ’ features of my the...
متن کاملAlternating-code experiment for plasma-line studies
We present results of the first plasma-line measurement of the incoherent spectrum using the alternating-code technique with the EISCAT VHF radar. This technique, which has earlier mostly been used to measure high-resolution E-region ion-line spectra, turned out to be a very good alternative to other techniques for plasmaline measurements. The experiment provides simultaneous measurement of the...
متن کاملOptimization of Straight-Line Code Revisited
In this report we study the effect of an optimizing algorithm for straight–line code which first constructs a directed acyclic graph representing the given program and then generates code from it. We show that this algorithm produces optimal code with respect to the classical transformations such as Constant Folding, Common Subexpression Elimination, and Dead Code Elimination. In contrast to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2017.2777528